The ground handler dock capacitated pickup and delivery problem with time windows: A collaborative framework for air cargo operations

We study a typical problem within the air cargo supply chain, concerning transportation of standard Unit Load Devices (ULDs) from freight forwarders’ to ground handlers’ warehouses. First, ULDs are picked up by set available trucks at premises time window. Next, they delivered handlers, also window, and discharged according Last In First Out (LIFO) policy. Due space constraints, handlers have limited capacity serve waiting times may arise, especially in case forwarders do not coordinate their operations. Therefore, this paper we consider cooperative framework where is coordinated central planner. The goal planner find proper routing scheduling that minimizes sum warehouses, while satisfying trucks. propose two mathematical formulations, one based on other packing aspect problem. To solve large instances problem, an Adaptive Large Neighborhood Search algorithm developed. With numerical experiments, compare performances models metaheuristic, quantify benefits proposed reduce times.